Permutation groups and derangements of odd prime order
نویسندگان
چکیده
Let G be a transitive permutation group of degree n. We say that G is 2′elusive if n is divisible by an odd prime, but G does not contain a derangement of odd prime order. In this paper we study the structure of quasiprimitive and biquasiprimitive 2′-elusive permutation groups, extending earlier work of Giudici and Xu on elusive groups. As an application, we use our results to investigate automorphisms of finite arc-transitive graphs of prime valency.
منابع مشابه
PERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملDerangements and p-elements in permutation groups
2. (Jordan) A transitive permutation group of degree n > 1 contains a derangement. In fact (Cameron and Cohen) the proportion of derangements in a transitive group G is at least 1/n. Equality holds if and only if G is sharply 2transitive, and hence is the affine group {x 7→ ax + b : a, b ∈ F, a 6= 0} over a nearfield F. The finite nearfields were determined by Zassenhaus. They all have prime po...
متن کاملPrime order derangements in primitive permutation groups
Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|. We say that G is r-elusive if it does not contain a derangement of order r, and strongly r-elusive if it does not contain one of r-power order. In this note we determine the r-elusive and strongly r-elusive primitive acti...
متن کاملA note on transitive permutation groups of degree twice a prime
In this note, we consider transitive permutation groups of degree 2p, where p is an odd prime, that admit blocks of imprimitivity of size 2 but no blocks of imprimitivity of size p. Primitive permutation groups of degree twice a prime were first considered by Wielandt [6], while more recently, imprimitive permutation groups of degree twice a prime were studied by Lefèvre [2], Marušič [3], and M...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 151 شماره
صفحات -
تاریخ انتشار 2017